Bounds on the Minimum Homogeneous Distance of the pr-ary Image of Linear Block Codes Over the Galois Ring GR(pr, m)
نویسندگان
چکیده
In this paper, bounds are derived on the minimum homogeneous distance of the image of a linear block code over the Galois ring GR(p, m), with respect to any basis of GR(p, m). These bounds depend on the parameters of GR(p, m), the minimum Hamming distance of the block code, and the average value of the homogeneous weight applied on the base ring Zpr . Examples are given of Galois ring codes that meet these bounds.
منابع مشابه
Linear Codes over Galois Ring GR(p2, r) Related to Gauss sums
Linear codes over finite rings become one of hot topics in coding theory after Hommons et al.([4], 1994) discovered that several remarkable nonlinear binary codes with some linear-like properties are the images of Gray map of linear codes over Z4. In this paper we consider two series of linear codes C(G) and C̃(G) over Galois ring R = GR(p2,r), where G is a subgroup of R(s) ∗ and R(s) = GR(p2,rs...
متن کاملConvolutional Codes Over Rings
Convolutional codes over rings behave quite differently from convolutional codes over fields, but they are the ones best suited for phase modulation. This behavior depends strongly on the structure of the underlying ring. Some basic concepts about ring convolutional codes, in particular over Zpr , and their structural properties such as basicity, systematicity, non-catastrophicity and minimalit...
متن کاملA Gilbert-Varshamov type bound for linear codes over Galois rings
In this paper we derive a Gilbert-Varshamov type bound for linear codes over Galois rings. For linear codes over the Galois ring GR(pl; j) the result can be stated as follows. Given r; such that 0 < r < 1 and 0 < H 1 pj (1 r): Then for all n N; where N is a sufficiently large integer, there exist [n; k] GR linear codes over GR(pl; j) such that k=n r and d=n : Consequently, this bound does not g...
متن کاملLinear Codes over $\mathbb{F}_{q}[x]/(x^2)$ and $GR(p^2,m)$ Reaching the Griesmer Bound
We construct two series of linear codes over finite ring Fq[x]/(x) and Galois ring GR(p2,m) respectively reaching the Griesmer bound. They derive two series of codes over finite field Fq by Gray map. The first series of codes over Fq derived from Fq[x]/(x) are linear and also reach the Griesmer bound in some cases. Many of linear codes over finite field we constructed have two Hamming (non-zero...
متن کاملBases of the Galois Ring $GR(p^r, m)$ over the Integer Ring $Z_{p^r}$
The Galois ring GR(p,m) of characteristic p and cardinality p, where p is a prime and r,m ≥ 1 are integers, is a Galois extension of the residue class ring Zpr by a root ω of a monic basic irreducible polynomial of degree m over Zpr . Every element of GR(p ,m) can be expressed uniquely as a polynomial in ω with coefficients in Zpr and degree less than or equal to m − 1, thus GR(p,m) is a free m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 53 شماره
صفحات -
تاریخ انتشار 2007